Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
covering$17255$ - traduction vers allemand
TYPE OF COMPUTATIONAL PROBLEM
Covering Problem; Covering problem; Rainbow covering
covering
n. Belag, Überzug
fig leaf
![''[[The Expulsion from the Garden of Eden]]'', by [[Masaccio]], before and after restoration. It was painted in 1425, covered up in 1680, and restored in 1980.](https://commons.wikimedia.org/wiki/Special:FilePath/Masaccio-TheExpulsionOfAdamAndEveFromEden-Restoration.jpg?width=200 "''[[The Expulsion from the Garden of Eden]]'', by [[Masaccio]], before and after restoration. It was painted in 1425, covered up in 1680, and restored in 1980.")
![chaste]]" [[Pope]]s; later, most such coverings were removed.](https://commons.wikimedia.org/wiki/Special:FilePath/Mercury fig leaf.jpg?width=200 "chaste]]\" [[Pope]]s; later, most such coverings were removed.")
LEAF OF THE FIG TREE, TRADITIONALLY USED IN ART TO OBSCURE NUDITY
Figleaf; Fig leaves; Fig leaf covering
Feigenblatt
the floor
WIKIMEDIA DISAMBIGUATION PAGE
Floor Covering; Counterfloor; The Floor
das Wort erhalten
Définition
covering
n.
Cover, tegument, integument, capsule, top, case.
Wikipédia
Covering problems
In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that. Covering problems are minimization problems and usually integer linear programs, whose dual problems are called packing problems.
The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem, and its special cases, the vertex cover problem and the edge cover problem.
